ParIC: A Family of Parallel Incomplete Cholesky Preconditioners
نویسندگان
چکیده
A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the setting up of the precon-ditioner, and during the application of the preconditioner. Overlap is not necessary to achieve high performance. Fill-in levels are considered in a global way. If necessary, the technique may be implemented as a global reordering of the unknowns. Experimental results are reported for two-dimensional problems.
منابع مشابه
Performance Evaluation of a New Parallel Preconditioner School of Computer Science
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the pre-conditioned conjugate gradient method. We have developed a new class of preconditioners, support tree preconditioners, that are based on the connectivity of the graphs corresponding to the matrices and are well-structured for parallel implementation. In this paper, ...
متن کاملPerformance evaluation of a new parallel preconditioner
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کاملCarnegie Mellon University Pittsburgh , PA 15213 Keith D . Gremban Marco ZaghaGary L .
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کاملParallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution
The paper analyses various parallel incomplete factorizations based on the non-overlapping domain decomposition. The general framework is applied to the investigation of the preconditioning step in cg-like methods. Under certain conditions imposed on the nite element mesh, all matrix and vector types given by the special data distribution can be used in the matrix-by-vector multiplications. Not...
متن کاملParallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for constructing and applying preconditioners on multiprocessors using incomplete factorizations with selective inversion for improved latency-tolerance. We provide empirical results on the efficiency, scalability and quality of our precond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000